Every Natural Number Is the Sum of Forty-nine Palindromes

نویسنده

  • William D. Banks
چکیده

It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes. 1. Statement of Result Let N ..= {0, 1, 2, . . .} denote the set of natural numbers (including zero). Every number n 2 N has a unique decimal representation of the form

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sums of Palindromes: an Approach via Automata

Recently, Cilleruelo, Luca, & Baxter proved, for all bases b ≥ 5, that every natural number is the sum of at most 3 natural numbers whose base-b representation is a palindrome. However, the cases b = 2, 3, 4 were left unresolved. We prove, using a decision procedure based on automata, that every natural number is the sum of at most 4 natural numbers whose base-2 representation is a palindrome. ...

متن کامل

On the variable sum exdeg index and cut edges of graphs

The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number,  du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.

متن کامل

The unit sum number of discrete modules

In this paper, we show that every element of a discrete module is a sum of two units if and only if its endomorphism ring has no factor ring isomorphic to $Z_{2}$. We also characterize unit sum number equal to two for the endomorphism ring of quasi-discrete modules with finite exchange property.

متن کامل

( 1 , k ) - Compositions

A (1, k)-composition of a positive integer n consists of an ordered sequence of the integers 1 and k whose sum is n. A palindromic (1, k)-composition is one for which the sequence is the same from left to right as from right to left. We give recursive equations and generating functions for the total number of such compositions and palindromes, and for the number of 1’s, k’s, “+”signs and summan...

متن کامل

The sum-annihilating essential ideal graph of a commutative ring

Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016